Expected performance of cryoarray
نویسندگان
چکیده
منابع مشابه
ar X iv : a st ro - p h / 02 08 32 6 v 1 1 6 A ug 2 00 2 1 Expected Performance of CryoArray
WIMP-nucleon cross sections σ ∼ < 10 −9 pb may be probed by ton-scale experiments with low thresholds and background rates ∼ 20 events per year. An array of cryogenic detectors (" CryoArray ") could perform well enough to reach this goal. Sufficient discrimination and background suppression of photons has already been demonstrated. Reduction of neutron backgrounds may be achieved by siting the ...
متن کاملThe Expected Performance Curve
In several research domains concerned with classification tasks, curves like ROC are often used to assess the quality of a particular model or to compare two or more models with respect to various operating points. Researchers also often publish some statistics coming from the ROC, such as the socalled break-even point or equal error rate. The purpose of this paper is to first argue that these ...
متن کاملExpected Performance of Robust Estimators Near Discontinuities
I n extracting a polynomial surface patch nearan intensity or range discontinuity, a robust estimator must tolerate not only the truly random bad data (“random outliers”), but also the coherently structured points ((bseudo outliers”) that belong to a different surface. To characterize the performance of least median of squares, M-estimators, Hough transforms, RANSAC, and MINPRAN on data contain...
متن کاملOperation and Expected Performance of the NLC
‘The main linacs for the proposed Next Linear Collider (NLC) provide acceleration of up to 500 GeV per beam. The linacs operate in a regime where unavoidable imperfections and even natural ground motion cause significant emittance dilutions. In order to achieve the NLC luminosity goals, small emittance beams must be transported with an emittance growth of less than SLAC-PUB-7354 November 1996 O...
متن کاملExpected Performance of Dijkstra's Shortest Path Algorithm
We show that the expected number of decrease-key operations in Dijkstra's shortest path algorithm is O(n log(1+m=n)) for an n-vertex, m-arc graph. The bound holds for any graph structure; the only assumption we make is that for every vertex, the lengths of its incoming arcs are drawn independently from the same distribution. The same bound holds with high probability. This result explains the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B - Proceedings Supplements
سال: 2003
ISSN: 0920-5632
DOI: 10.1016/s0920-5632(03)02113-3